On random walks

ثبت نشده
چکیده

4.* Use 3. to show that the average number of visits to a > 0 before returning to the origin is 1 (hint: show that it is closely related to the expectation of some geometric random variable). Solution: let Na be the number of visits to a before returning to 0. Using question 3. one has P(Na = 0) = 1 2 + 1 2 (1− 1/a) (call that probability q). Note that once you’ve made a visit to a (that is given Na ≥ 1), which happens with probability 1− q, the number of returns is a geometric random variable, with probability of success 1− q : the probability of coming back to a before 0 (failure) is 1 2 + 1 2 (1− 1/a) = q. Therefore, E[Na − 1|Na ≥ 1] = 1 1−q .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS

A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...

متن کامل

Large Deviations for Random Walks in a Mixing Random Environment and Other (Non-Markov) Random Walks

We extend a recent work by S. R. S. Varadhan [8] on large deviations for random walks in a product random environment to include more general random walks on the lattice. In particular, some reinforced random walks and several classes of random walks in Gibbs fields are included. c © 2004 Wiley Periodicals, Inc.

متن کامل

Branching Random Walks and Their Applications to Population Studies

Recent investigations have demonstrated that continuous-time branching random walks on multidimensional lattices give an important example of stochastic models in which the evolutionary processes depend on the structure of a medium and the spatial dynamics. It is convenient to describe such processes in terms of birth, death, and walks of particles on the lattice. The structure of a medium is d...

متن کامل

Reducing Search Lengths with Locally Precomputed Partial Random Walks

Random walks can be used to search complex networks for a desired resource. To reduce the number of hops necessary to find resources, we propose a search mechanism based on building random walks connecting together partial walks that have been precomputed at each network node in an initial stage. The resources found in each partial walk are registered in its associated Bloom filter. Searches ca...

متن کامل

Random Walks on Finite Quantum Groups

1 Markov chains and random walks in classical probability . . 3 2 Quantum Markov chains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3 Random walks on comodule algebras . . . . . . . . . . . . . . . . . . . . . . 7 4 Random walks on finite quantum groups . . . . . . . . . . . . . . . . . . 11 5 Spatial Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . ....

متن کامل

Random walks on hypergroup of conics in finite fields

In this paper we study random walks on the hypergroup of conics in finite fields. We investigate the behavior of random walks on this hypergroup, the equilibrium distribution and the mixing times. We use the coupling method to show that the mixing time of random walks on hypergroup of conics is only linear. Mathematics Subject Classifications: 60D05, 11A99. Keywoords: random walks, hypergroups,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014